Sophistication vs Logical Depth

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity, Depth, and Sophistication

T wo measures of the "meaningful" complexity of an infini te string are shown to be equivalent up to a constant (under app ropriate translati on) . "Sophis t ica tion", defined by Koppel and Atlan [3], is the size of t he projectible par t of the st ring's minimal description and forma lizes t he amount of pla nni ng which wen t into t he constru ct ion of the str ing. "Dept h". defi ned by Ben...

متن کامل

Robustness of Logical Depth

Usually one can quantify the subjective notion of useful information in two different perspectives: static resources – measuring the amount of planing required to construct the object; or dynamic resources – measuring the computational effort required to produce the object. We study the robustness of logical depth measuring dynamic resources, proving that small variations in the significance le...

متن کامل

Logical Depth and Physical Complexity

Some mathematical and natural objects (a random sequence, a sequence of zeros, a perfect crystal, a gas) are intuitively trivial, while others (e.g. the human body, the digits of π) contain internal evidence of a nontrivial causal history. We formalize this distinction by defining an object’s “logical depth” as the time required by a standard universal Turing machine to generate it from an inpu...

متن کامل

On the logical depth function

We investigate the logical depth function of finite strings. For the function associated with string x with argument b and value d we have that d is the least running time of the computation of an element of the set of b-incompressible programs for x. For a given string we consider the possible gap between two values of this function if the arguments differ by just a constant. We show that ther...

متن کامل

Logical Vs.analogical or Symbolic vs. Connectionist or Neat vs. Scruffy

Minsky subscribes to neither of these extremist views. Instead, he argues that Artificial Intelligence must employ many approaches. Artificial Intelligence is not like circuit theory and electromagnetism. There is nothing wonderfully unifying like Kirchhoff's laws are to circuit theory or Maxwell's equations are to electromagnetism. Instead of looking for a "Right Way", Minsky believes that the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory of Computing Systems

سال: 2016

ISSN: 1432-4350,1433-0490

DOI: 10.1007/s00224-016-9672-6